Shortest Geometric Paths Analysis In Structural Biology

Obstacle distance for car-like robots

This paper shows how to compute the nonholonomic distance between a point-wise car-like robot and polygonal obstacles. Geometric constructions to compute the shortest paths from a configuration (given orientation and position in the plane of the robot) to a position (i.e., a configuration with unspecified final orientation) are first presented. The geometric structure of the reachable set (set ...

OPTIMIZATION FORMULATION FOR NONLINEAR STRUCTURAL ANALYSIS

In this paper, the effect of angle between predictor and corrector surfaces on the structural analysis is investigated. Two objective functions are formulated based on this angle and also the load factor. Optimizing these functions, and using the structural equilibrium path’s geometry, lead to two new constraints for the nonlinear solver. Besides, one more formula is achieved, which was p...

Shortest Paths with Pairwise-Distinct Edge Labels: Finding Biochemical Pathways in Metabolic Networks

A problem studied in Systems Biology is how to find shortest paths in metabolic networks. Unfortunately, simple (i.e., graph theoretic) shortest paths do not properly reflect biochemical facts. An approach to overcome this issue is to use edge labels and search for paths with distinct labels. In this paper, we show that such biologically feasible shortest paths are hard to compute. Moreover, we...

Shortest Path Problem on Intuitionistic Fuzzy Network

Received 17September 2013; accepted 5 October2013 L Baba Abstract. Finding shortest paths in graphs has been the area of interest for many researchers. Shortest paths are one of the fundamental and most widely used concepts in networks. In this paper the authors present an algorithm to find an Intuitionistic Fuzzy Shortest Path (IFSP) in a directed graph in which the cost of every edges are rep...

Geometric Shortest Paths and Network Optimization